The poset of bipartitions
نویسندگان
چکیده
Bipartitional relations were introduced by Foata and Zeilberger in their characterization of relations which give rise to equidistribution of the associated inversion statistic and major index. We consider the natural partial order on bipartitional relations given by inclusion. We show that, with respect to this partial order, the bipartitional relations on a set of size [Formula: see text] form a graded lattice of rank [Formula: see text]. Moreover, we prove that the order complex of this lattice is homotopy equivalent to a sphere of dimension [Formula: see text]. Each proper interval in this lattice has either a contractible order complex, or is isomorphic to the direct product of Boolean lattices and smaller lattices of bipartitional relations. As a consequence, we obtain that the Möbius function of every interval is 0, 1, or -1. The main tool in the proofs is discrete Morse theory as developed by Forman, and an application of this theory to order complexes of graded posets, designed by Babson and Hersh, in the extended form of Hersh and Welker.
منابع مشابه
The extended permutohedron on a transitive binary relation
For a given transitive binary relation e on a set E, the transitive closures of open (i.e., co-transitive in e) sets, called the regular closed subsets, form an ortholattice Reg(e), the extended permutohedron on e. This construction, which contains the poset Clop(e) of all clopen sets, is a common generalization of known notions such as the generalized permutohedron on a partially ordered set o...
متن کامل2 00 9 the Poset of Bipartitions
Bipartitional relations were introduced by Foata and Zeilberger in their characterization of relations which give rise to equidistribution of the associated inversion statistic and major index. We consider the natural partial order on bipartitional relations given by inclusion. We show that, with respect to this partial order, the bipartitional relations on a set of size n form a graded lattice...
متن کاملNETS AND SEPARATED S-POSETS
Nets, useful topological tools, used to generalize certainconcepts that may only be general enough in the context of metricspaces. In this work we introduce this concept in an $S$-poset, aposet with an action of a posemigroup $S$ on it whichis a very useful structure in computer sciences and interestingfor mathematicians, and give the the concept of $S$-net. Using $S$-nets and itsconvergency we...
متن کاملThe concept of logic entropy on D-posets
In this paper, a new invariant called {it logic entropy} for dynamical systems on a D-poset is introduced. Also, the {it conditional logical entropy} is defined and then some of its properties are studied. The invariance of the {it logic entropy} of a system under isomorphism is proved. At the end, the notion of an $ m $-generator of a dynamical system is introduced and a version of the Kolm...
متن کاملCONDITIONAL EXPECTATION IN THE KOPKA'S D-POSETS
The notion of a $D$-poset was introduced in a connection withquantum mechanical models. In this paper, we introduce theconditional expectation of random variables on theK^{o}pka's $D$-Poset and prove the basic properties ofconditional expectation on this structure.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- European journal of combinatorics = Journal europeen de combinatoire = Europaische Zeitschrift fur Kombinatorik
دوره 32 8 شماره
صفحات -
تاریخ انتشار 2011